On interplay of quantifiers in Gödel-Dummett fuzzy logics
نویسندگان
چکیده
منابع مشابه
On interplay of quantifiers in Gödel-Dummett fuzzy logics
Axiomatization of Gödel-Dummett predicate logics S2G, S3G, and PG, where PG is the weakest logic in which all prenex operations are sound, and the relationships of these logics to logics known from the literature are discussed. Examples of non-prenexable formulas are given for those logics where some prenex operation is not available. Inter-expressibility of quantifiers is explored for each of ...
متن کاملCounter-Model Search in Gödel-Dummett Logics
We present a new method for deciding Gödel-Dummett logic LC. We first characterize the validity of irreducible sequents of LC by the existence of r-cycles in bi-colored graphs and we propose a linear algorithm to detect r-cycles and build counter-models. Then we characterize the validity of formulae by the existence of r-cycles in boolean constrained graphs. We also give a parallel method to de...
متن کاملBounding Resource Consumption with Gödel-Dummett Logics
Gödel-Dummett logic LC and its finite approximations LCn are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LCn logics as a tool to bound resource consumption in some process calculi. We introduce a non-deterministic process calculus where the consumption of a particular resource denoted • is explicit and provide an operational semantics which meas...
متن کاملJoining Gödel and Zadeh Fuzzy Logics in Fuzzy Description Logics
Ontologies have succeeded as a knowledge representation formalism in many domains of application. Nevertheless, they are not suitable to represent vague or imprecise information. To overcome this limitation, several extensions to classical ontologies based on fuzzy logic have been proposed. Even though different fuzzy logics lead to fuzzy ontologies with very different logical properties, the c...
متن کاملNote on inter-expressibility of logical connectives in finitely-valued Gödel-Dummett logics
Let Gm be the m-valued Gödel-Dummett fuzzy logic. If m ≥ 3 then neither conjunction nor implication is in Gm expressible in terms of the remaining connectives. This fact remains true even if the propositional language is enriched by propositional constants for all truth values. Gödel-Dummett fuzzy propositional logic can be defined as an extension of the intuitionistic propositional logic by th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2006
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-005-0322-y